A generalisation of the Oja subspace flow
نویسندگان
چکیده
Recently, a novel flow for computing the eigenvectors associated with the smallest eigenvalues of a symmetric but not necessarily positive definite matrix was introduced. This meant that the eigenvectors associated with the smallest eigenvalues could be found simply by reversing the sign of the matrix. The current paper derives a cost function and the corresponding negative gradient flow which converges to the same subspace as is spanned by the minor components. The flow is related to Oja’s major subspace flow which converges for positive definite matrices. With a suitable coordinate transformation, the Oja flow can be converted into the corresponding novel minor subspace flow. But the minor subspace flow does also converge for cases where no transformation back into an Oja flow exists. Thus, the novel flow is a generalisation of the Oja subspace flow. Keywords— Algebraic and differential geometry, Eigenvalues and eigenfunctions, Hessian matrices, Iterative methods, Matrix decomposition, Signal subspaces, Stability analysis
منابع مشابه
Stability of Oja's PCA Subspace Rule
Principal eigenvectors of the data covariance matrix or the subspace spanned by them, called PCA subspace, provide optimal solutions to several information representation tasks. Recently, many neural approaches have been proposed for learning them (see, e.g., Hertz r t a/. 1991; Oja 1992). A well-known algorithm for learning the PCA subspace of the input vectors is so-called Op’s subspace rule ...
متن کاملAn Amendment of Fast Subspace Tracking Methods
Tuning stepsize between convergence rate and steady state error level or stability is a problem in some subspace tracking schemes. Methods in DPM and OJA class may show sparks in their steady state error sometimes, even with a rather small stepsize. By a study on the schemes’ updating formula, it is found that the update only happens in a specific plane but not all the subspace basis. Through a...
متن کاملPrincipal and Minor Subspace Tracking: Algorithms & Stability Analysis
We consider the problem of tracking the minor or principal subspace of a positive Hermitian covariance matrix. We first propose a fast and numerically robust implementation of Oja algorithm (FOOja: Fast Orthogonal Oja). The latter is said fast in the sense that its computational cost is of order O(np) flops per iteration where n is the size of the observation vector and p < n is the number of m...
متن کاملSubspace Tracking Algorithms for Millimeter Wave MIMO Channel Estimation with Hybrid Beamforming
This paper proposes the use of subspace tracking algorithms for performing MIMO channel estimation at millimeter wave (mmWave) frequencies. Using a subspace approach, we develop a protocol enabling the estimation of the right (resp. left) singular vectors at the transmitter (resp. receiver) side; then, we adapt the projection approximation subspace tracking with deflation (PASTd) and the orthog...
متن کاملA New Look at the Power Method for Fast Subspace Tracking
Hua, Yingbo, Xiang, Yong, Chen, Tianping, Abed-Meraim, Karim, and Miao, Yongfeng, A New Look at the Power Method for Fast Subspace Tracking, Digital Signal Processing 9 (1999), 297–314. A class of fast subspace tracking methods such as the Oja method, the projection approximation subspace tracking (PAST) method, and the novel information criterion (NIC) method can be viewed as power-based metho...
متن کامل